Distinct Distances from Three Points
نویسندگان
چکیده
Let p1, p2, p3 be three noncollinear points in the plane, and let P be a set of n other points in the plane. We show that the number of distinct distances between p1, p2, p3 and the points of P is Ω(n), improving the lower bound Ω(n) of Elekes and Szabó [4] (and considerably simplifying the analysis).
منابع مشابه
Distinct distances between points and lines
We show that for m points and n lines in R2, the number of distinct distances between the points and the lines is Ω(m1/5n3/5), as long as m1/2 ≤ n ≤ m2. We also prove that for any m points in the plane, not all on a line, the number of distances between these points and the lines that they span is Ω(m4/3). The problem of bounding the number of distinct point-line distances can be reduced to the...
متن کاملOn distinct distances in homogeneous sets in the Euclidean space
It is shown that a homogeneous set of n points in the d-dimensional Euclidean space determines at least Ω(n2d/(d 2+1)/ log n) distinct distances for a constant c(d) > 0. In three-space, the above general bound is slightly improved and it is shown that a homogeneous set of n points determines at least Ω(n.6091) distinct distances.
متن کاملDetermining optimal value of the shape parameter $c$ in RBF for unequal distances topographical points by Cross-Validation algorithm
Several radial basis function based methods contain a free shape parameter which has a crucial role in the accuracy of the methods. Performance evaluation of this parameter in different functions with various data has always been a topic of study. In the present paper, we consider studying the methods which determine an optimal value for the shape parameter in interpolations of radial basis ...
متن کاملOn Distinct Distances and Incidences: Elekes’s Transformation and the New Algebraic Developments∗
We first present a transformation that Gyuri Elekes has devised, about a decade ago, from the celebrated problem of Erdős of lower-bounding the number of distinct distances determined by a set S of s points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in three dimensions. Elekes has offered conjectures involving the new setup, which, if corre...
متن کاملOn distinct distances among points in general position and other related problems
A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vectors, it is called parallelogram free. We show that there exist n-element point sets in the plane in general position, and parallelogram free, that determine only O(n/ √ logn) distinct distances. This answers a question o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 25 شماره
صفحات -
تاریخ انتشار 2016